Search results for "Programming Languages"
showing 10 items of 138 documents
Domēnspecifisku rīku konfigurācijas valoda un tās realizācija
2014
Promocijas darbā ir izstrādāts konfigurators plaša profila DSML rīku definēšanai. Konfigurators balstās uz ideju, ka DSML definīciju var uzdot ar universālu metamodeli (UML klašu diagrammas formā), kura pēc tam konfiguratorā tiek apstrādāta, lai nodrošinātu rīka darbību. Turklāt nestandarta gadījumiem, kad esošās metamodeļa iespējas ir nepietiekošas, metamodelī ir realizēts paplašinājuma punktu mehānisms, kas ļauj pievienot rīkam specifiski transformāciju valodā noprogrammētu funkcionalitāti. Izstrādātais konfigurators ir pārbaudīts vairākos praktiskos lietojumos un apliecinājis savu efektivitāti.
Feasibility of finite and infinite paths in data dependent programs
2005
This paper considers the feasibility of finite and infinite paths in programs in two simple programming languages. The language LBASE allows to express the dependencies of real time systems on integer data, the language LTIM can model quantitative timing constraints in r.t.s. specifications. It is proven that the problem of whether a given LBASE or LTIM program has an infinite feasible path (i.e. whether it can exhibit an infinite behaviour) is decidable. The possibilities to characterise the sets of all feasible finite and infinite paths in LBASE and LTIM programs are also discussed. The infinite feasible path existence problem is proven decidable also for the language LTIBA which has both…
Probabilities to Accept Languages by Quantum Finite Automata
1999
We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the hierarchy. These probabilities converge to 1/2.
Automata and forbidden words
1998
Abstract Let L ( M ) be the (factorial) language avoiding a given anti-factorial language M . We design an automaton accepting L ( M ) and built from the language M . The construction is effective if M is finite. If M is the set of minimal forbidden words of a single word ν, the automaton turns out to be the factor automaton of ν (the minimal automaton accepting the set of factors of ν). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a nontrivial upper bound on the number of minimal forbidden words of a word.
Fifth Generation Networking Principles for a Service Driven Future Internet Architecture
2010
Published version of an article published in Wireless Personal Communications, vol. 57:393-411. Also available from the publisher at: http://dx.doi.org/10.1007/s11277-010-0076-7 The vision of all-IP networks where IP forms the simple common layer understandable across the whole network has undeniable advantages. However, such simplicity comes as a major hurdle to flexibility and functionality to the architecture. This is evident from the increasingly numerous and complex engineering solutions and optimizations required to accommodate essential qualities like mobility, security, realtime communication support etc or to mitigate the shortcomings inherent in the 'traditional Internet' architec…
ValWorkBench: an open source Java library for cluster validation, with applications to microarray data analysis.
2015
Background: Cluster analysis is one of the most well known activities in scientific investigation and the object of research in many disciplines, ranging from statistics to computer science. It is central to the life sciences due to the advent of high throughput technologies, e.g., classification of tumors. In particular, in cluster analysis, it is of relevance to assess cluster quality and to predict the number of clusters in a dataset, if any. This latter task is usually performed via internal validation measures. Despite their potentially important role, both the use of classic internal validation measures and the design of new ones, specific for microarray data, do not seem to have grea…
Simulation-based estimation of branching models for LTR retrotransposons
2017
Abstract Motivation LTR retrotransposons are mobile elements that are able, like retroviruses, to copy and move inside eukaryotic genomes. In the present work, we propose a branching model for studying the propagation of LTR retrotransposons in these genomes. This model allows us to take into account both the positions and the degradation level of LTR retrotransposons copies. In our model, the duplication rate is also allowed to vary with the degradation level. Results Various functions have been implemented in order to simulate their spread and visualization tools are proposed. Based on these simulation tools, we have developed a first method to evaluate the parameters of this propagation …
Artificial intelligence techniques for cancer treatment planning
1988
An artificial intelligence system, NEWCHEM, for the development of new oncology therapies is described. This system takes into account the most recent advances in molecular and cellular biology and in cell-drug interaction, and aims to guide experimentation in the design of new optimal protocols. Further work is being carried out, aimed to embody in the system all the basic knowledge of biology, physiopathology and pharmacology, to reason qualitatively from first principles so as to be able to suggest cancer therapies.
Partitioning of on-demand electron pairs
2014
The on-demand generation and separation of entangled photon pairs are key components of quantum information processing in quantum optics. In an electronic analogue, the decomposition of electron pairs represents an essential building block for using the quantum state of ballistic electrons in electron quantum optics. The scattering of electrons has been used to probe the particle statistics of stochastic sources in Hanbury Brown and Twiss experiments and the recent advent of on-demand sources further offers the possibility to achieve indistinguishability between multiple sources in Hong-Ou-Mandel experiments. Cooper pairs impinging stochastically at a mesoscopic beamsplitter have been succe…
From sentence production to text production: Investigating fundamental processes
1991
The purpose of the present article is to present a nom exhaustive review about the cognitive psychology research in english and in french language, dealing with the study of the organization and the functioning of the oral and written language production mechanisms.